Real-Time Languages, Timed Alternating Automata, and Timed Temporal Logics: Relationships and Specifications
نویسندگان
چکیده
منابع مشابه
Timed Alternating-Time Temporal Logic
We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems f...
متن کاملVerifying Real-Time Joint Action Specifications Using Timed Automata
In this paper, an approach to the verification of specifications of reactive real-time systems is proposed. DisCo is an object-oriented method based on joint actions. It supports stepwise refinement and specification of real-time properties. A mapping from the DisCo language into timed automata is introduced. Timed automata are finite-state machines extended with features to support the specifi...
متن کاملWeak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.
متن کاملDecidability of Emptiness Checking in various Alternating Timed Automata and Connections to Timed Logics
In the initial parts of this thesis, we start by approaching the problem of decidability of emptiness of one variable alternating stopwatch automata. We start off by presenting an overview of important results in the field of hybrid systems and useful subclasses and their proofs. Then we go on to alternating timed automata and redo the previously known result that one clock ATA has decidable la...
متن کاملTimed Temporal Logics
Since the early 1990’s, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.08.409